Dynamic belief revision operators
نویسندگان
چکیده
منابع مشابه
Characterizing Relevant Belief Revision Operators
This paper introduces a framework for relevant belief revision. We represent agent’s beliefs in prime implicants and express agent’s preference on beliefs as a pre-order over terms. We define a belief revision operator via minimising the change of the prime implicants of the existing beliefs and the incoming information with respect to agent’s preferences. We show that such a belief revision op...
متن کاملProbabilistic dynamic belief revision
We investigate the discrete (finite) case of the Popper-Renyi theory of conditional probability, introducing discrete conditional probabilistic models for knowledge and conditional belief, and comparing them with the more standard plausibility models. We also consider a related notion, that of safe belief, which is a weak (non-negatively introspective) type of “knowledge”. We develop a probabil...
متن کاملPrime Implicate-based Belief Revision Operators
A belief revision operator can be seen as a function which takes as input a set of beliefsK and an input formula φ and outputs a new set of beliefs K ?φ. Many of the belief revision schemes that have been defined in the literature require additional input. The extra information they need comes in various forms: relations over subsets of the sets of beliefs [2], epistemic entrenchment relations ...
متن کاملDynamic logic for belief revision
We show how belief revision can be treated systematically in the format of dynamicepistemic logic, when operators of conditional belief are added. The core engine consists of definable update rules for changing plausibility relations between worlds, which have been proposed independently in the dynamic-epistemic literature on preference change. Our analysis yields two new types of modal result....
متن کاملConflict-Based Belief Revision Operators in Possibilistic Logic
In this paper, we investigate belief revision in possibilistic logic, which is a weighted logic proposed to deal with incomplete and uncertain information. Existing revision operators in possibilistic logic are restricted in the sense that the input information can only be a formula instead of a possibilistic knowledge base which is a set of weighted formulas. To break this restriction, we cons...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2003
ISSN: 0004-3702
DOI: 10.1016/s0004-3702(03)00017-1